منابع مشابه
Effect of radius versus rotation speed in artificial gravity.
Artificial gravity by centrifugation can lead to perceptual disturbances in the form of motion sickness and/or misperception of motion during head movements, but the degree of perceptual disturbance during centrifugation in 0-g has not been thoroughly investigated. It is known that during whole-body on-axis yaw rotation in 0-g, head movements in pitch and roll cause very little disturbance, des...
متن کاملTurnaround in cyclic cosmology.
It is speculated how dark energy in a brane world can help reconcile an infinitely cyclic cosmology with the second law of thermodynamics. A cyclic model is described, in which dark energy with w<-1 equation of state leads to a turnaround at a time, extremely shortly before the would-be big rip, at which both volume and entropy of our Universe decrease by a gigantic factor, while very many inde...
متن کاملTrees with given maximum degree minimizing the spectral radius
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let T (n,∆, l) be the tree which minimizes the spectral radius of all trees of order n with exactly l vertices of maximum degree ∆. In this paper, T (n,∆, l) is determined for ∆ = 3, and for l ≤ 3 and n large enough. It is proven that for sufficiently large n, T (n, 3, l) is a caterpillar with (almost...
متن کاملEla Distance Spectral Radius of Trees with Fixed Maximum Degree∗
Abstract. Distance energy is a newly introduced molecular graph-based analog of the total π-electron energy, and it is defined as the sum of the absolute eigenvalues of the molecular distance matrix. For trees and unicyclic graphs, distance energy is equal to the doubled value of the distance spectral radius. In this paper, we introduce a general transformation that increases the distance spect...
متن کاملThe Spectral Radius and the Maximum Degree of Irregular Graphs
Let G be an irregular graph on n vertices with maximum degree ∆ and diameter D. We show that ∆ − λ1 > 1 nD , where λ1 is the largest eigenvalue of the adjacency matrix of G. We also study the effect of adding or removing few edges on the spectral radius of a regular graph. 1 Preliminaries Our graph notation is standard (see West [22]). For a graph G, we denote by λi(G) the i-th largest eigenval...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics D
سال: 2019
ISSN: 0218-2718,1793-6594
DOI: 10.1142/s0218271819500585